Probabilistic Analysis of a Capacitated Vehicle Routing Problem II
نویسندگان
چکیده
منابع مشابه
A novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملA Capacitated Vehicle Routing Problem considering Satisfaction Level of Customers: A Genetic Algorithm
Capacitated vehicle routing problem (CVRP) is one of the most well-known and applicable issues in the field of transportation. It has been proved to be an NP-Complete problem. To this end, it is needed to develop a high-performance algorithm to solve the problem, particularly in large scales. This paper develops a novel mathematical model for the CVRP considering the satisfaction level of deman...
متن کاملOn the capacitated vehicle routing problem
We consider the Vehicle Routing Problem, in which a fixed fleet of delivery vehicles of uniform capacity must service known customer demands for a single commodity from a common depot at minimum transit cost. This difficult combinatorial problem contains both the Bin Packing Problem and the Traveling Salesman Problem (TSP) as special cases and conceptually lies at the intersection of these two ...
متن کاملThe pyramidal capacitated vehicle routing problem
This paper introduces the Pyramidal Capacitated Vehicle Routing Problem (PCVRP) as a restricted version of the Capacitated Vehicle Routing Problem (CVRP). In the PCVRP each route is required to be pyramidal in a sense generalized from the Pyramidal Traveling Salesman Problem (PTSP). A pyramidal route is defined as a route on which the vehicle first visits customers in increasing order of custom...
متن کاملThe Quadratic Capacitated Vehicle Routing Problem
In this article we introduce the Quadratic Capacitated Vehicle Routing Problem (QCVRP), a combinatorial optimization problem that arises in practical applications in logistics and transportation. The QCVRP extends two other known problems, the Capacitated Vehicle Routing Problem (CVRP) and the Quadratic Symmetric Traveling Salesman Problem (QSTSP), the former by considering a modified cost matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 1994
ISSN: 1050-5164
DOI: 10.1214/aoap/1177004969